Problem:
 g(h(x1)) -> g(f(s(x1)))
 f(s(s(s(x1)))) -> h(f(s(h(x1))))
 f(h(x1)) -> h(f(s(h(x1))))
 h(x1) -> x1
 f(f(s(s(x1)))) -> s(s(s(f(f(x1)))))
 b(a(x1)) -> a(b(x1))
 a(a(a(x1))) -> b(a(a(b(x1))))
 b(b(b(b(x1)))) -> a(x1)

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {6,5,4,3,2}
   transitions:
    h1(15) -> 16*
    h1(12) -> 13*
    f1(14) -> 15*
    s1(13) -> 14*
    g0(1) -> 2*
    h0(1) -> 4*
    f0(1) -> 3*
    s0(1) -> 1*
    b0(1) -> 5*
    a0(1) -> 6*
    1 -> 4,12
    12 -> 13*
    15 -> 16,3
    16 -> 15,3
  problem:
   
  Qed